Necessity conditions for $L\sp p$ multipliers with power weights

Some Inequalities for Nilpotent Multipliers of Powerful p-Groups

VLSI neural network with digital weights and analog multipliers

A VLSI feedforward neural network is presented that makes use of digital weights and analog multipliers. The network is trained in a chip-in-loop fashion with a host computer implementing the training algorithm. The chip uses a serial digital weight bus implemented by a long shift register to input the weights. The inputs and outputs of the network are provided directly at pins on the chip. The...

A Goal Programming Method for Finding Common Weights in DEA with an Improved Discriminating Power for Efficiency

A characteristic of data envelopment analysis (DEA) is to allow individual decision making units (DMUs) to select the most advantageous weights in calculating their efficiency scores. This flexibility, on the other hand, deters the comparison among DMUs on a common base. For dealing with this difficulty and assessing all the DMUs on the same scale, this paper proposes using a multiple objective...

Necessity of transversality conditions for stochastic problems

This paper establishes (i) an extension of Michel’s (1990, Theorem 1) necessity result to an abstract reduced-form model, (ii) a generalization of the results of Weitzman (1973) and Ekeland and Scheinkman (1986), and (iii) a new result that is useful particularly in the case of homogeneous returns. These results are shown for an extremely general discrete-time reduced-form model that does not a...

SUMMABILITY KERNELS FOR L p MULTIPLIERS

In this paper we have characterized the space of summa-bility kernels for the case p = 1 and p = 2. For other values of p we give a necessary condition for a function Λ to be a summability kernel. For the case p = 1, we have studied the properties of measures which are transferred from M (Z) to M (R) by summability kernels. Further, we have extended every l p sequence to L q (R) multipliers for...